Obstructions to special Lagrangian desingularizations and the Lagrangian prescribed boundary problem
نویسندگان
چکیده
We also use soft methods from symplectic geometry (the relative version of the h–principle for Lagrangian immersions) and tools from algebraic topology to prove (both positive and negative) results about Lagrangian desingularizations of Lagrangian submanifolds with isolated singularities; we view the (Maslov-zero) Lagrangian desingularization problem as the natural soft analogue of the special Lagrangian smoothing problem.
منابع مشابه
Augmented Lagrangian method for solving absolute value equation and its application in two-point boundary value problems
One of the most important topic that consider in recent years by researcher is absolute value equation (AVE). The absolute value equation seems to be a useful tool in optimization since it subsumes the linear complementarity problem and thus also linear programming and convex quadratic programming. This paper introduce a new method for solving absolute value equation. To do this, we transform a...
متن کاملThe Lagrangian Relaxation Method for the Shortest Path Problem Considering Transportation Plans and Budgetary Constraint
In this paper, a constrained shortest path problem (CSP) in a network is investigated, in which some special plans for each link with corresponding pre-determined costs as well as reduction values in the link travel time are considered. The purpose is to find a path and selecting the best plans on its links, to improve the travel time as most as possible, while the costs of conducting plans do ...
متن کاملتحلیل دینامیکی سدهای بتنی وزنی با مدلسازی مخزن به روشهای لاگرانژی و اویلری
Because of different behavior of reservoir water and dam material, the determination of hydrodynamic pressure during earthquake is very complicated. Thus, different formulations have been presented for modeling of the dam reservoir system under dynamic loading such as earthquake. These formulations can be categorized into two general groups, which are Lagrangian and Eulerian, each having advant...
متن کاملLagrangian Relaxation Method for the Step fixed-charge Transportation Problem
In this paper, a step fixed charge transportation problem is developed where the products are sent from the sources to the destinations in existence of both unit and step fixed-charges. The proposed model determines the amount of products in the existing routes with the aim of minimizing the total cost (sum of unit and step fixed-charges) to satisfy the demand of each customer. As the problem i...
متن کاملAcceleration of Lagrangian Method for the Vehicle Routing Problem with Time Windows
The analytic center cutting plane method (ACCPM) is one of successful methods to solve nondifferentiable optimization problems. In this paper ACCPM is used for the first time in the vehicle routing problem with time windows (VRPTW) to accelerate lagrangian relaxation procedure for the problem. At first the basic cutting plane algorithm and its relationship with column generation method is clari...
متن کامل